Hyperspace Graph Paper: Visualising interactions between search algorithms and landscapes

Hyperspace graph paper (HSGP) is a technique for visualising surfaces defined over moderate dimensional binary spaces1. The key to this technique is in unfolding the hypercube using recursive steps so that the topology of the high dimensional space is reflected in a recursive structure in the two-dimensional unfolding (see Figure 1). In this paper, we describe the original studies that tested the ease of using of this layout technique, and then describe a preliminary case study of its application to understanding the interaction between search algorithms and landscape structures.